A robust solver for elliptic PDEs in 3D complex geometries
نویسندگان
چکیده
We develop a boundary integral equation solver for elliptic partial differential equations on complex 3D geometries. Our method is efficient, high-order accurate and robustly handles A key component our singular near-singular layer potential evaluation scheme, hedgehog: simple extrapolation of the solution along line to boundary. present series geometry-processing algorithms required hedgehog run efficiently with accuracy guarantees arbitrary geometries an adaptive upsampling scheme based iteration-free heuristic quadrature error. validate performance numerical tests compare approach competing local method.
منابع مشابه
A high-order 3D boundary integral equation solver for elliptic PDEs in smooth domains
We present a high-order boundary integral equation solver for 3D elliptic boundary value problems on domains with smooth boundaries. We use Nyström’s method for discretization, and combine it with special quadrature rules for the singular kernels that appear in the boundary integrals. The overall asymptotic complexity of our method is O(N), where N is the number of discretization points on the ...
متن کاملRobust FETI solvers for multiscale elliptic PDEs
Finite element tearing and interconnecting (FETI) methods are efficient parallel domain decomposition solvers for large-scale finite element equations. In this work we investigate the robustness of FETI methods in case of highly heterogeneous (multiscale) coefficients. Our main application are magnetic field computations where both large jumps and large variation in the reluctivity coefficient ...
متن کاملParallel Performance of a 3D Elliptic Solver
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic problems have good numerical properties and a potential for high parallel efficiency. In this note parallel performance of a circulant block-factorization based preconditioner applied to a 3D model problem is investigated...
متن کاملMultidomain Local Fourier Method for PDEs in Complex Geometries
but with higher frequencies and amplitudes of the oscillating components), only a low accuracy can be achieved after an aaordable number of PCG iterations. The reason is that a strip-wise domain decomposition cannot handle large changes in non-constant coeecients in the lengthwise direction (see explanation at the end of section (5.1)). More general domain decompositions in the form of rectangu...
متن کاملFast algorithms for PDEs in simple and complex geometries
We review some fast and accurate numerical techniques for solving elliptic equations in complicated domains developed by the author and his colleagues in recent past. These are based on a combination of fast algorithms for regular domains and various domain embedding techniques. The fast algorithms for regular domains are derived from analysis of integral equation approach for solving elliptic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2021
ISSN: ['1090-2716', '0021-9991']
DOI: https://doi.org/10.1016/j.jcp.2021.110511